Facility Location Games with Ordinal Preferences

نویسندگان

چکیده

We consider a new setting of facility location games with ordinal preferences. In such setting, we have set agents and facilities. Each agent is located on line has an preference over the Our goal to design strategyproof mechanisms that elicit truthful information (preferences and/or locations) from locate facilities minimize both maximum total cost objectives as well maximize minimum utility objectives. For four possible objectives, 2-facility settings in which only preferences are private, or locations private. each combination settings, provide lower upper bounds approximation ratios mechanisms, asymptotically tight up constant. Finally, discuss generalization our results beyond two when can misreport

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shapley Facility Location Games

Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of competition in a variety of scenarios. In a typical facility location game, users/customers/voters are mapped to a metric space representing their preferences, ...

متن کامل

Facility Location Games with Dual Preference

In this paper, we focus on the facility location games with the property of dual preference. Dual preference property indicates that both two preferences of agents, staying close to and staying away from the facility(s), exist in the facility location game. We will explore two types of facility location games with this property, the dual character facility location game and the two-oppositefaci...

متن کامل

Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds

We propose a new representation setting for hedonic games, where each agent partitions the set of other agents into friends, enemies, and neutral agents, with friends and enemies being ranked. Under the assumption that preferences are monotonic (respectively, antimonotonic) with respect to the addition of friends (respectively, enemies), we propose a bipolar extension of the Bossong–Schweigert ...

متن کامل

Stable Sets for Simple Games with Ordinal Preferences

In this paper, stable sets for simple games with ordinal preferences are studied in the case where the number of alternatives is finite. It is shown that the condition for the existence of a nonempty core for any possible combination of players' preferences is also a necessary and sufficient condition for the existence of a unique stable set. Moreover, a necessary and sufficient condition that ...

متن کامل

Non-cooperative Facility Location and Covering Games

We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-22105-7_13